منابع مشابه
A Lower Bound Theorem
Motivated by Candes and Donoho′s work (Candés, E J, Donoho, D L, Recovering edges in ill-posed inverse problems: optimality of curvelet frames. Ann. Stat. 30, 784-842 (2002)), this paper is devoted to giving a lower bound of minimax mean square errors for Riesz fractional integration transforms and Bessel transforms.
متن کاملAn Improved Lower Bound for Folkman’s Theorem
Folkman’s theorem asserts that for each k ∈ N, there exists a natural number n = F (k) such that whenever the elements of [n] are two-coloured, there exists a set A ⊂ [n] of size k with the property that all the sums of the form ∑ x∈B x, where B is a nonempty subset of A, are contained in [n] and have the same colour. In 1989, Erdős and Spencer showed that F (k) ≥ 2ck2/ log , where c > 0 is an ...
متن کاملLower bound theorem for normal pseudomanifolds
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup’s generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected tria...
متن کاملRazborov Disjointness Lower Bound , Forster ’ S Theorem
In this lecture, we show two results dealing with lower bounds in communication complexity. The first lower bound is an Ω(n) lower bound on the distributional complexity of Disjointness due to [3, 8]. Here we will present the simplified proof presented in [8]. In the second part, we will show how to obtain lower bounds on the unbounded error probabilistic communication complexity by Forster’s m...
متن کاملStrassen’s lower bound for polynomial evaluation and Bezout’s theorem
Strassen’s lower bound for polynomial evaluation and Bezout’s theorem Recall Strassen’s algorithm from the previous lecture: Given: (a0, . . . , an−1), (x1, . . . , xn) ∈ K, and polynomial p(x) = ∑n−1 i=0 aix i Task: find (z1, . . . , zn), zi = p(xi) How many steps do we need to accomplish this task? Using the Fast Fourier Transform (FFT) we need O(n log n) steps. Strassen was interested whethe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90104-1